OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
نویسندگان
چکیده
منابع مشابه
Optimal Path and Minimal Spanning Trees in Random Weighted Networks
We review results on the scaling of the optimal path length lopt in random networks with weighted links or nodes. We refer to such networks as “weighted” or “disordered” networks. The optimal path is the path with minimum sum of the weights. In strong disorder, where the maximal weight along the path dominates the sum, we find that lopt increases dramatically compared to the known small world r...
متن کاملRandom Spanning Trees and the Prediction of Weighted Graphs
We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the graph. The cutsize is induced by the unknown adversarial labeling of the graph...
متن کاملOptimal Ventcel Graphs, Minimal Cost Spanning Trees and Asymptotic Probabilities
for any i ∈ S, where μ is the invariant distribution of {X n}. Let S = {i ∈ S : h(i) = 0}, which is called the global minimum set. Various asymptotic probabilities related to S have been established in [3]. Among others, starting with the uniform or invariant distribution, the expected hitting time E T of S is of order −δ and the constants δ and h(i) above can be expressed in terms of a complic...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملPercolation and Minimal Spanning Trees
Consider a random set V n of points in the box n; n) d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyse the empirical distribution function F n of the lengths of edges in a minimal (Euclidean) spanning tree T n on V n. We express the limit of F n , as n ! 1, in terms of the free energies of a family of percolation processes der...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bifurcation and Chaos
سال: 2007
ISSN: 0218-1274,1793-6551
DOI: 10.1142/s0218127407018361